A Sequent Calculus for a Modal Logic on Finite Data Trees
نویسندگان
چکیده
We investigate the proof theory of a modal fragment of XPath equipped with data (in)equality tests over finite data trees, i.e. over finite unranked trees where nodes are labelled with both a symbol from a finite alphabet and a single data value from an infinite domain. We present a sound and complete sequent calculus for this logic, which yields the optimal PSPACE complexity bound for its validity problem. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems (Complexity of proof procedures), F.4.1 Mathematical Logic (Modal logic), H.2.3 Languages (Query languages)
منابع مشابه
Finite Model Property of Pretransitive Modal Logic
The finite model property of the quasi-transitive modal logic K32 = K ⊕ ✷✷p → ✷✷✷p is proved. This modal logic is conservatively extended to the tense logic Kt32. We present a Gentzen sequent calculus Gt32 for Kt 3 2 which admits cut elimination. The sequent calculus Gt 3 2 is shown to have the finite model property by a construction of finite syntactic model. It follows that Kt32 has the finit...
متن کاملGrammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures
A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal operator [a] comes with a converse [a]−1. Extending previous works on nested sequent systems for tense logics, we show all grammar logics (with or without conver...
متن کاملResiduated Basic Logic II. Interpolation, Decidability and Embedding
We prove that the sequent calculus LRBL for residuated basic logic RBL has strong finite model property, and that intuitionistic logic can be embedded into basic propositional logic BPL. Thus RBL is decidable. Moreover, it follows that the class of residuated basic algebras has the finite embeddability property, and that BPL is PSPACE-complete, and that intuitionistic logic can be embedded into...
متن کاملCut-free common knowledge
Starting off from the infinitary system for common knowledge over multi-modal epistemic logic presented in Alberucci and Jäger [1], we apply the finite model property to “finitize” this deductive system. The result is a cut-free, sound and complete sequent calculus for common knowledge.
متن کاملThe Logic of Conditional Beliefs: Neighbourhood Semantics and Sequent Calculus
The logic of Conditional Beliefs has been introduced by Board, Baltag and Smets to reason about knowledge and revisable beliefs in a multi-agent setting. It is shown how the semantics of this logic, defined in terms of plausibility models, can be equivalently formulated in terms of neighbourhood models, a multi-agent generalisation of Lewis’ spheres models. On the basis of this new semantics, a...
متن کامل